Toward Optimal Secure Distributed Storage Systems With Exact Repair
نویسندگان
چکیده
منابع مشابه
Distributed storage systems with secure and exact repair - New results
Distributed storage systems (DSS) in the presence of a passive eavesdropper are considered in this paper. A typical DSS is characterized by 3 parameters (n, k, d) where, a file is stored in a distributed manner across n nodes such that it can be recovered entirely from any k out of n nodes. Whenever a node fails, d 2 [k, n) nodes participate in the repair process. In this paper, we study the ex...
متن کاملGeneric Secure Repair for Distributed Storage
This paper studies the problem of repairing secret sharing schemes, i.e., schemes that encode a message into n shares, assigned to n nodes, so that any n − r nodes can decode the message but any colluding z nodes cannot infer any information about the message. In the event of node failures so that shares held by the failed nodes are lost, the system needs to be repaired by reconstructing and re...
متن کاملOn the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage
The high repair cost of (n, k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of codes, called Regenerating Codes, that optimally trade off storage cost for repair bandwidth. In this paper, we address bandwidth-optimal (n, k, d) Exact-Repair MDS codes, which allow for any failed node to be repaired exactly with access to arbitrary d survivor nodes, where k ≤ d...
متن کاملExact Regeneration Codes for Distributed Storage Repair Using Interference Alignment
The high repair cost of (n, k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of codes, called Regenerating Codes, that optimally trade off storage cost for repair bandwidth. On one end of this spectrum of Regenerating Codes are Minimum Storage Regenerating (MSR) codes that can match the minimum storage cost of MDS codes while also significantly reducing repai...
متن کاملDistributed Data Storage with Minimum Storage Regenerating Codes - Exact and Functional Repair are Asymptotically Equally Efficient
We consider a set up where a file of size M is stored in n distributed storage nodes, using an (n, k) minimum storage regenerating (MSR) code, i.e., a maximum distance separable (MDS) code that also allows efficient exactrepair of any failed node. The MDS property ensures that the original file can be reconstructed even if any n− k storage nodes fail. When a node fails, a new node collects data...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2016
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2544340